A path formula for the sock sorting problem
نویسندگان
چکیده
Допустим, что в сушильном барабане находятся $n$ различных пар носков. По окончании сушки носки выкладываются на стол один за другим. Если очередной вынутый носок оказывается из той же пары, и лежащих столе, то пара убирается, если нет, остается столе до тех пор, пока не появится его пары. Каждый раз, когда $2n$ носков выкладывается стол, мы записываем число носков, остающихся столе. В работе получена явная формула для вероятности события, состоящего том, полученная последовательность совпадает с заданной последовательностью длины $2n$.
منابع مشابه
Sock Sorting
Algorithms of a social nature are extremely important and we are very dependent on certain “data structures” like names and social security numbers, on courts and on the postal system, and on various other social structures which enable us to perform activities like calling someone (you need her name for that), suing someone, or sending someone a bill. Unlike the situation in the theory of comp...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA hybrid algorithm for the path center problem
Let a graph G = (V;E) be given. In the path center problem we want to find a path P in G such that the maximum weighted distance of P to every vertex in V is minimized. In this paper a genetic algorithm and ahybrid of genetic and ant colony algorithms are presented for the path center problem. Some test problems are examined to compare the algorithms. The results show that for almost all exampl...
متن کاملFluctuation Bounds for Sock-sorting and Other Stochastic Processes
Using standard methods from empirical-process theory, in particular symmetrization, we derive exponential bounds on the uctuations of of stochastic processes which may be represented as the averages of many small functions. As examples, self-service queueing and storage problems are analyzed. We eliminate some of the very large constants or polynomial factors which have appeared in other, more ...
متن کاملA Nondominated Sorting Genetic Algorithm for Shortest Path Routing Problem
The shortest path routing problem is a multiobjective nonlinear optimization problem with constraints. This problem has been addressed by considering Quality of service parameters, delay and cost objectives separately or as a weighted sum of both objectives. Multiobjective evolutionary algorithms can find multiple pareto-optimal solutions in one single run and this ability makes them attractive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ?????? ???????????? ? ?? ??????????
سال: 2021
ISSN: ['0040-361X', '2305-3151']
DOI: https://doi.org/10.4213/tvp5506